Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments

نویسندگان

  • Laura Bozzelli
  • Alberto Molinari
  • Angelo Montanari
  • Adriano Peron
  • Pietro Sala
چکیده

The model checking problem has thoroughly been explored in the context of standard point-based temporal logics, such as LTL, CTL, and CTL⇤, whereas model checking for interval temporal logics has been brought to the attention only very recently. In this paper, we prove that the model checking problem for the logic of Allen’s relations started-by and finished-by is highly intractable, as it can be proved to be EXPSPACE-hard. Such a lower bound immediately propagates to the full Halpern and Shoham’s modal logic of time intervals (HS). In contrast, we show that other noteworthy HS fragments, namely, Propositional Neighbourhood Logic extended with modalities for the Allen relation starts (resp., finishes) and its inverse started-by (resp., finished-by), turn out to have—maybe unexpectedly—the same complexity as LTL (i.e., they are PSPACE-complete), thus joining the group of other already studied, well-behaved albeit less expressive, HS fragments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions

In this paper, we systematically investigate the model checking problem for interval temporal logic (ITL), where interval labeling is defined by means of regular expressions. In the last years, ITL model checking has received an increasing attention as a viable alternative to the traditional (point-based) temporal logic model checking, which can be recovered as a special case. Most results have...

متن کامل

Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives

Model checking allows one to automatically verify a specification of the expected properties ofa system against a formal model of its behaviour (generally, a Kripke structure). Point-basedtemporal logics, such as LTL, CTL, and CTL∗, that describe how the system evolves state-by-state,are commonly used as specification languages. They proved themselves quite successful in a variety<l...

متن کامل

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions

In this paper, we investigate the model checking (MC) problem for Halpern and Shoham’s interval temporal logic HS. In the last years, interval temporal logic MC has received an increasing attention as a viable alternative to the traditional (point-based) temporal logic MC, which can be recovered as a special case. Most results have been obtained under the homogeneity assumption, that constrains...

متن کامل

A Model Checking Procedure for Interval Temporal Logics based on Track Representatives

Model checking is commonly recognized as one of the most effective tools for system verification. While it has been systematically investigated in the context of classical, point-based temporal logics, it is still largely unexplored in the interval logic setting. Recently, a non-elementary model checking algorithm for Halpern and Shoham’s modal logic of time intervals HS, interpreted over finit...

متن کامل

Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification

Interval temporal logics are based on temporal structures where time intervals, rather than time instants, are the primitive ontological entities. They employ modal operators corresponding to various relations between intervals, known as Allen’s relations. Technically, validity in interval temporal logics translates to dyadic second-order logic, thus explaining their complex computational behav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016